Finding Approximate Palindromes in Strings Quickly and Simply
نویسنده
چکیده
Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-time where n is the length of the string and k is the number of “errors” allowed in the palindrome. Its worstcase time-complexity is O(n) but this does not occur with real biological sequences. A more complex algorithm guarantees O(k.n) worst-case time complexity. Code of the simple algorithm will be placed at http://www.csse.monash.edu.au/ ∼lloyd/tildeProgLang/Java2/Palindromes/
منابع مشابه
Finding approximate palindromes in strings
We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de nition is based on the usual edit operations of approximate pattern matching, and the algorithm we give, for a string of size n on a xed alphabet, runs in O(kn) time. We also discuss two implementationrelated improvement...
متن کاملFinding Palindromes: Variants and Algorithms
The problem of finding palindromes in strings appears in many variants: find exact palindromes, ignore punctuation in palindromes, require space around palindromes, etc. This paper introduces several predicates that represent variants of the problem of finding palindromes in strings. It also introduces properties for palindrome predicates, and shows which predicates satisfy which properties. Th...
متن کاملLooking for All Palindromes in a String
A palindrome is a string of the form αα', where α and α' are also strings and reverse to each other. The problem of the paper is defined as follows: given a string S of length n, find all palindromes occurring in the given string S. In the paper, we present an algorithm based on suffix trees to find palindromes. Our algorithm will find all maximum palindromes which are not contained in any othe...
متن کاملComputing Longest Single-arm-gapped Palindromes in a String
In this paper, we introduce new types of approximate palindromes called singlearm-gapped palindromes (shortly SAGPs). A SAGP contains a gap in either its left or right arm, which is in the form of either wgucuw or wucugw, where w and u are non-empty strings, w and u are respectively the reversed strings of w and u, g is a gap, and c is either a single character or the empty string. We classify ...
متن کاملCounting and Verifying Maximal Palindromes
A palindrome is a symmetric string that reads the same forward and backward. Let Pals(w) denote the set of maximal palindromes of a string w in which each palindrome is represented by a pair (c, r), where c is the center and r is the radius of the palindrome. We say that two strings w and z are pal-distinct if Pals(w) 6= Pals(z). Firstly, we describe the number of pal-distinct strings, and show...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cs/0412004 شماره
صفحات -
تاریخ انتشار 2004